Investigation of automorphism group for code associated with optimal curve of genus three
نویسندگان
چکیده
منابع مشابه
detection of volatile compounds of medicinal plants with some nano-sorbents using modified or new methodologies and investigation of antioxidant activity of their methanolic extracts
in this work, a novel and fast method for direct analysis of volatile compounds (davc) of medicinal plants has been developed by holding a filament from different parts of a plant in the gc injection port. the extraction and analysis of volatile components of a small amount of plant were carried out in one-step without any sample preparation. after optimization of temperature, extraction time a...
AUTOMORPHISM GROUP OF GROUPS OF ORDER pqr
H"{o}lder in 1893 characterized all groups of order $pqr$ where $p>q>r$ are prime numbers. In this paper, by using new presentations of these groups, we compute their full automorphism group.
متن کاملan investigation of the types of text reduction in subtitling: a case study of the persian film gilaneh with english subtitles
چکیده ندارد.
15 صفحه اولModified Random Linear Code Scheme (rlce) with Using Properties of Automorphism Group of Goppa Code
McEliece cryptosystem is a public-key cryptosystem predicated on error-redressing codes. In 2016, Y.Wang[4] introduced another Scheme kenned as Random Linear Code encryption scheme. In this paper, we present a modification of the Random Linear Code encryption scheme which invigorates its security. For this we utilize some properties of the automorphism groups of Goppa codes. Also we have given ...
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prikladnaya diskretnaya matematika. Prilozhenie
سال: 2018
ISSN: 2226-308X
DOI: 10.17223/2226308x/11/36